Taking proof-based verified computation a few steps closer to practicality (extended version)

نویسندگان

  • Srinath T. V. Setty
  • Victor Vu
  • Nikhil Panpalia
  • Benjamin Braun
  • Andrew J. Blumberg
  • Michael Walfish
چکیده

We describe GINGER, a built system for unconditional, general-purpose, and nearly practical verification of outsourced computation. GINGER is based on PEPPER, which uses the PCP theorem and cryptographic techniques to implement an efficient argument system (a kind of interactive protocol). GINGER slashes the query size and costs via theoretical refinements that are of independent interest; broadens the computational model to include (primitive) floating-point fractions, inequality comparisons, logical operations, and conditional control flow; and includes a parallel GPU-based implementation that dramatically reduces latency.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Taking proof - based verified computation a few steps closer to practicality ( extended

We describe GINGER, a built system for unconditional, general-purpose, and nearly practical verification of outsourced computation. GINGER is based on PEPPER, which uses the PCP theorem and cryptographic techniques to implement an efficient argument system (a kind of interactive protocol). GINGER slashes the query size and costs via theoretical refinements that are of independent interest; broa...

متن کامل

Taking Proof-Based Verified Computation a Few Steps Closer to Practicality

We describe GINGER, a built system for unconditional, general-purpose, and nearly practical verification of outsourced computation. GINGER is based on PEPPER, which uses the PCP theorem and cryptographic techniques to implement an efficient argument system (a kind of interactive protocol). GINGER slashes the query size and costs via theoretical refinements that are of independent interest; broa...

متن کامل

Taking proof-based verified computation a few steps closer to practicality1

We describe GINGER, a built system for unconditional, general-purpose, and nearly practical verification of outsourced computation. GINGER is based on PEPPER, which uses the PCP theorem and cryptographic techniques to implement an efficient argument system (a kind of interactive protocol). GINGER slashes query costs via protocol refinements; broadens the computational model to include (primitiv...

متن کامل

فرایند کشش عمیق استوانه‌های با نسبت کشش خیلی بالا

Deep drawing of cylindrical shapes with high limiting drawing ratio (LDR) values is relatively difficult. Annealing is a further operation, which in turn adds costs and consumes significantly time to the forming process. In the present work, cylindrical cups from brass sheet were made with only limited anneal during few steps, but having LDR of 9 that is about 2 times higher than previous works...

متن کامل

Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings

The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision process (POMDP). Yet, despite the growing importance and applications of decentralized POMDP models in the multiagents arena, few algorithms have been developed for efficiently deriving joint policies for these models. This ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2012  شماره 

صفحات  -

تاریخ انتشار 2012